Necessary and sufficient conditions for the existence of a positive definite solution of a nonlinear matrix equation

Some necessary and sufficient conditions for the existence of a positive definite solution of the nonlinear matrix equation X+A*X ^?α A=Q (0<α≤1) are given. By the way an iterative method is presented. Furthermore, the convergence and error estimation of the iterative algorithm are derived. The illustrative numerical examples due to Peng are worked out.     

A stencil of the finite-difference method for the 2D convection diffusion equation and its new iterative scheme

The paper gives the numerical stencil for the two-dimensional convection diffusion equation and the technique of elimination, and builds up the new iterative scheme to solve the implicit difference equation. The scheme's convergence and its higher rate of convergence than the Jacobi iteration are proved. And the numerical example indicates that the new scheme has the same parallelism and a higher rate of convergence than the Jacobi iteration.     

A third-order convergent iterative method for solving non-linear equations

In this paper, we present and analyse a new predictor-corrector iterative method for solving non-linear single variable equations. The convergence analysis establishes that the new method is cubically convergent. Numerical tests show that the method is comparable with the well-known existing methods and in many cases gives better results.     

Some iterative algorithms for the obstacle problems

In this paper we propose some iterative algorithms for the obstacle problems discretized by the finite difference method. We rewrite the obstacle problem to an equivalent complementarity problem. We use the regularization trick to non-smooth absolute function. Then we apply the Newton's method to obtain an iterative algorithm. Some other two algorithms based on this algorithm are derived. Numerical experiments show the effective of the algorithm.     

Common fixed points of a countable family of multivalued quasi-nonexpansive mappings in uniformly convex Banach spaces

In this paper, we introduce a one-step iterative scheme for finding a common fixed point of a countable family of multivalued quasi-nonexpansive mappings in a real uniformly convex Banach space. We establish weak and strong convergence theorems of the proposed iterative scheme under some control conditions.     

Convergence of P-regular splitting iterative methods for non-Hermitian positive semidefinite linear systems

In this paper, we study the convergence of P-regular splitting iterative methods for singular and non-singular non-Hermitian positive semidefinite linear systems, which generalize the known results. Some numerical experiments are performed to illustrate the convergence results.     

Frequency domain analysis of acoustic wave propagation in heterogeneous media considering iterative coupling procedures between the method of fundamental solutions and Kansa's method

Acoustic wave propagation in heterogeneous media is a topic of significant interest in many areas of science and engineering, including aeroacoustics and sound propagation in oceans. In the present work, numerical frequency domain models based on the joint use of the method of fundamental solutions and of the radial basis function collocation method (also known as Kansa's method) are discussed. In this context, the method of fundamental solutions is used to model the homogeneous part of the propagation domain, while Kansa's method is employed to model the presence of heterogeneities. The coupling between the two parts of the propagation domain is performed iteratively, allowing independent spatial discretization between the different subdomains of the model (i.e. matching collocation points at common surfaces are not necessary). Additionally, an optimised algorithm, based on the use of a varying relaxation parameter, is employed to speed up and/or to ensure the convergence of the iterative coupling process. At the end of the paper, numerical results illustrate the applicability and potentialities of the proposed formulations. Copyright © 2011 John Wiley & Sons, Ltd.     

H∞ model reduction for negative imaginary systems

This paper is concerned with the H_∞ model reduction for negative imaginary (NI) systems. For a given linear time-invariant system that is stable and NI, our goal is to find a stable reduced-order NI system satisfying a pre-specified H_∞ approximation error bound. Sufficient conditions in terms of matrix inequalities are derived for the existence and construction of an H_∞ reduced-order NI system. Iterative algorithms are provided to solve the matrix inequalities and to minimise the H_∞ approximation error. Finally, a numerical example is used to demonstrate the effectiveness of the proposed model reduction method.     

Distillation separation sequence optimization synthesis based on application of adaptive parallel tabu search

Abstract

Distillation separation sequences can be described as binary tree data structures, because of the analogous structures of distillation separation sequences and binary trees, and then by applying graph theory, the change mechanism of neighborhood separation points based on binary trees is built, correspondingly a kind of highly effective, evolutionary neighborhood structure is constructed. For the purpose of researching further tabu search algorithms, adaptive mechanisms and parallel techniques are introduced. That is, according to memory frequency information, the tabu length and the number of candidates are adaptively adjusted, and multitask parallel technology is realized through the arrangement of the search assignments. The example shows that adaptive parallel tabu searches can solve, successfully, large‐scale distillation separation sequence synthesis problems.     

An automatic iterative decision-making method for intuitionistic fuzzy linguistic preference relations

As a new preference structure, the intuitionistic fuzzy linguistic preference relation (IFLPR) was recently introduced to efficiently deal with situations in which the membership and non-membership are represented as linguistic terms. In this paper, we study the issues of additive consistency and the derivation of the intuitionistic fuzzy weight vector of an IFLPR. First, the new concepts of order consistency, additive consistency and weak transitivity for IFLPRs are introduced, and followed by a discussion of the characterisation about additive consistent IFLPRs. Then, a parameterised transformation approach is investigated to convert the normalised intuitionistic fuzzy weight vector into additive consistent IFLPRs. After that, a linear optimisation model is established to derive the normalised intuitionistic fuzzy weights for IFLPRs, and a consistency index is defined to measure the deviation degree between an IFLPR and its additive consistent IFLPR. Furthermore, we develop an automatic iterative decision-making method to improve the IFLPRs with unacceptable additive consistency until the adjusted IFLPRs are acceptable additive consistent, and it helps the decision-maker to obtain the reasonable and reliable decision-making results. Finally, an illustrative example is provided to demonstrate the validity and applicability of the proposed method.